Probabilistic Counting Algorithms for Data Base Applications
نویسندگان
چکیده
منابع مشابه
Periodic Oscillations in the Analysis of Algorithms and Their Cancellations
A large number of results in analysis of algorithms contain fluctuations. A typical result might read “The expected number of . . . for large n behaves like log2 n + constant + delta(log2 n), where delta(x) is a periodic function of period one and mean zero.” Examples include various trie parameters, approximate counting, probabilistic counting, radix exchange sort, leader election, skip lists,...
متن کاملNovel Algorithms TempCIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Temporal Databases and Future Possibilities
In this paper we present novel algorithms TempCIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Temporal Databases and we also discussed future possibilities. We consider the problem of discovering frequent itemsets and association-rules between/among items in a large database of transactional databases acquired under uncertainty in certain time. With each timestamp...
متن کاملSelf-stabilizing Counting in Mobile Sensor Networks with a Base Station
Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computational power. In this paper, we extend the results of Angluin et al (see [4,3,2,1]) by finding self-stabilizing algorithms to count the number of agents in the network. We focus on two different models of communication, with a fixe...
متن کاملGraph-based Approximate Counting for Relational Probabilistic Models
One of the key operations inside most relational probabilistic models is counting be it for parameter/structure learning or for efficient inference. However, most approaches use the logical structure for counting and do not exploit any fast counting methods. In this work-inprogress, we explore the closer connections to graph data bases and propose methods that obtain both exact and approximate ...
متن کاملNovel Algorithms CIPFP for Mining Frequent Patterns using Counting Inference from Probabilistic Databases and Future Possibilities
We consider the problem of discovering frequent item sets and association rules between items in a large database of transactional databases acquired under uncertainty. A probabilistic database considered here is one in which with each transaction associated is a probability, represents the confidence that the transaction will occur with given associated certainty. In this paper, we address the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 31 شماره
صفحات -
تاریخ انتشار 1985